Square-free Values of Reducible Polynomials
نویسنده
چکیده
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.
منابع مشابه
Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms
A. We give upper bounds on the numbers of various classes of polynomials reducible over Z and over Z/pZ, and on the number of matrices in SL(n),GL(n) and Sp(2n) with reducible characteristic polynomials, and on polynomials with non-generic Galois groups. We use our result to show that a random (in the appropriate sense) element of the mapping class group of a closed surface is pseudo-Ano...
متن کاملA New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p^q)
Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental polynomials of a monic irreducible polynomial over Galois Field GF(2) [1]. In this paper a new method to search monic Irreducible Polynomials (IPs) over Galois f...
متن کاملSquare-free values of polynomials over the rational function field
Article history: Received 23 August 2013 Accepted 23 August 2013 Available online xxxx Communicated by K. Soundararajan
متن کاملNewman Polynomials, Reducibility, and Roots on the Unit Circle
A length k Newman polynomial is any polynomial of the form za1 + · · ·+zak (where a1 < · · · < ak). Some Newman polynomials are reducible over the rationals, and some are not. Some Newman polynomials have roots on the unit circle, and some do not. Defining, in a natural way, what we mean by the “proportion” of length k Newman polynomials with a given property, we prove that • 1/4 of length 3 Ne...
متن کاملRoot separation for reducible integer polynomials
We construct parametric families of (monic) reducible polynomials having two roots very close to each other.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017